#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

const int N = 10010;

vector<int> ans;
int money[N];
int n, ret, s;
bool toend;

void dfs(int pos, int sum)
{
    if (sum > ret || toend)
    {
        return;
    }
    else if (sum == ret)
    {
        for (int i = 0; i < ans.size(); i++)
        {
            if (i != 0)
            {
                cout << " ";
            }
            cout << ans[i];
        }
        toend = true;
        return;
    }
    if (pos < n)
    {
        ans.push_back(money[pos]);
        dfs(pos + 1, sum + money[pos]);
        ans.pop_back();
        dfs(pos + 1, sum);
    }
}

int main()
{
    cin >> n >> ret;
    for (int i = 0; i < n; i++)
    {
        cin >> money[i];
        s += money[i];
    }
    if (s < ret)
    {
        cout << "No Solution";
        return 0;
    }
    sort(money, money + n);
    dfs(0, 0);
    if (!toend)
    {
        cout << "No Solution";
    }
    return 0;
}